Constructing Cliques Using Restricted
نویسندگان
چکیده
The restricted backtracking algorithmic paradigm is applied to the Maximum Clique Problem. The notion of backtracking coordinates is introduced. The program searches for those cliques whose backtracking coordinates are bounded by the values given in the input.
منابع مشابه
Cliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملk-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
Many studies are aimed at identifying dense clusters/subgraphs from protein-protein interaction (PPI) networks for protein function prediction. However, the prediction performance based on the dense clusters is actually worse than a simple guilt-by-association method using neighbor counting ideas. This indicates that the local topological structures and properties of PPI networks are still open...
متن کاملCliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function
The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission into account, constructing graphs of a network that reflect the direction of information flow, and analyzing these directed graphs using algeb...
متن کاملMatching Hierarchical Structures Using Association Graphs
ÐIt is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) aassociation graph.o However, it is not clear how to apply this approach to computer vision problems where the graphs are hierarchically organized, i.e., are trees, since maximal cliques are not constrained to preserve the partial order. Here,...
متن کاملMatching Free Trees, Maximal Cliques, and Monotone Game Dynamics
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple payoff-monotonic dynamics from evolutionary game theory. We illustrate the power of the...
متن کامل